ZIG-ZAG RUNNING EXERCISES FOR BALL DRILL SKILLS
نویسندگان
چکیده
Tujuan penelitian ini untuk mengetahui pengaruh latihan lari zig zag terhadap kemampuan menggiring dalam cabang olahraga sepak bola. Penelitian menggunakan teknik eksperimen pendekatan quasi eksperiment dengan desain One Group Pretest posttest design. Populasi merupakan seluruh siswa kelas VIII SMP Negeri 1 Tilongkabila, jumlah 183 siswa. Sampel adalah 20 Siswa yang diambil Purposive sampling suatu kriteria tertentu. Analisis data mengunakan uji normalitas lilefors dan hipotesis uji-t. Hasilnya ada sebesar 36,88% bola di Tilongkabila.
منابع مشابه
The zig-zag product
The expander constructions based on algebraic methods can give expanders that are both explicit (i.e. we can quickly construct the graph, or even obtain neighborhood information without constructing the entire graph, and Ramanujan, meaning that the spectral gap is essentially as large as possible. It also follows from this spectral bound that the edge expansion of Ramanujan graphs is essentiall...
متن کاملZig-zag Path to Understanding
OUT understanding of the fundamental physical limits of information handling has developed along a very convoluted path. Most of the initially plausible physical conjectures have turned out to be wrong. A participant’s personal view of these events is not a disciplined contribution to the history of science. I do, however, last my own mistakes along with those of others.
متن کاملZIG-ZAG PVD – A Nontraditional Approach
Communication has to be secure in order to be kept private. The latest developments in the field of digital communication have made secret communication possible. Image hiding is a method in which a secret image is hidden in a cover image thereby forming a hybrid or stego image. In this paper, data hiding is performed by taking difference value of three and two neighbouring pixels by adapting Z...
متن کاملExpander Constructions ( Zig - Zag Expanders ) Lecturer : Cynthia
Construction 7.1 (Margulis [Mar]) Fix a positive integerM and let [M ] = {1, 2, . . . ,M}. Define the bipartite graph G = (V,E) as follows. Let V = [M ]2∪ [M ]2, where vertices in the first partite set are denoted (x, y)1 and vertices in the second partite set are denoted (x, y)2. From each vertex (x, y)1, put in edges to (x, y)2, (x, x+ y)2, (x, x+ y+1)2, (x+ y, y)2, and (x+ y+ 1, y)2, where a...
متن کاملZig-Zag Numberlink is NP-Complete
When can t terminal pairs in an m× n grid be connected by t vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness proofs: Lynch’s 1975 proof without the “cover all vertices” constraint, and Kotsuma and Takenaga’s 2010 proof when the paths are restricted to have the fewest possible cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jambura Journal of Sports Coaching
سال: 2021
ISSN: ['2654-3435', '2656-0437']
DOI: https://doi.org/10.37311/jjsc.v3i1.9644